Improved Upper Bounds for the Mixed Structured Singular Value - Automatic Control, IEEE Transactions on
نویسندگان
چکیده
In this paper, we take a new look at the mixed structured singular value problem, a problem of finding important applications in robust stability analysis. Several new upper bounds are proposed using a very simple approach which we call the multiplier approach. These new bounds are convex and computable by using linear matrix inequality (LMI) techniques. We show, most importantly, that these upper bounds are actually lower bounds of a well-known upper bound which involves the so-called D-scaling (for complex perturbations) and G-scaling (for real perturbations).
منابع مشابه
Improved Computation of Mixed Bounds for Flight Control Law Analysis
In this paper we describe an approach for improving the quality of upper and lower bounds on the structured singular value in the case of mixed real and complex uncertainty. The proposed approach uses constrained non-linear optimisation to improve the bounds on generated by standard algorithms, and is shown to be simple and computationally efficient to implement. The usefulness of the approach ...
متن کاملProperties of the Mixed /spl mu/ Problem and Its Bounds - Automatic Control, IEEE Transactions on
Upper and lower bounds for the mixed p problem have recently been developed, and here we examine the relationship of these bounds to each other and to p. A number of interesting properties are developed, and the implications of these properties for the robustness analysis of linear systems and the development of practical computation schemes are discussed. In particular we find that current tec...
متن کاملThe Real Structured Singular Value Is Hardly Approximable - Automatic Control, IEEE Transactions on
This paper investigates the problem of approximating the real structured singular value (real ). A negative result is provided which shows that the problem of checking if = 0 is NP-hard. This result is much more negative than the known NP-hard result for the problem of checking if < 1. One implication of our result is that is hardly approximable in the following sense: there does not exist an a...
متن کاملBounds for Solutions of the Discrete Algebraic Lyapunov Equation - Automatic Control, IEEE Transactions on
A family of sharp, arbitrarily tight upper and lower matrix bounds for solutions of the discrete algebraic Lyapunov are presented. The lower bounds are tighter than previously known ones. Unlike the majority of previously known upper bounds, those derived here have no restrictions on their applicability. Upper and lower bounds for individual eigenvalues and for the trace of the solution are fou...
متن کاملHigher order semidefinite relaxations for quadratic programming - Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
In this paper, we present improved versions of the standard semidefinite relaxation for quadratic programming, that underlies many important results in robustness analysis and combinatorial optimization. It is shown that the proposed polynomial time convex conditions are at least as strong as the standard ones, and usually better, but at a higher computational cost. Several applications of the ...
متن کامل